Heavy traffic limit for a tandem queue with identical service times
نویسندگان
چکیده
منابع مشابه
Heavy Traffic Limit Theorems for Two Tandem Polling Stations
We consider two tandem single-server stations in heavy traffic. There are two job types and they visit both stations in order. The first station processes jobs in an exhaustive service or gated service fashion and the second station uses an arbitrary nonidling service discipline. The stations have zero switch-over times. We prove heavy traffic limit theorems for the two-dimensional total worklo...
متن کاملA two-queue polling model with priority on one queue and heavy-tailed On/Off sources: a heavy-traffic limit
We consider a single-server polling system consisting of two queues of fluid with arrival process generated by a big number of heavy-tailed On/Off sources, and application in road traffic and communication systems. Classj fluid is assigned to queue j, j = 1,2. Server 2 visits both queues to process or let pass through it the corresponding fluid class. If there is class-2 fluid in the system, it...
متن کاملHeavy traffic limit theorems for a queue with Poisson ON/OFF long-range dependent sources and general service time distribution
In Internet environment, traffic flow to a link is typically modeled by superposition of ON/OFF based sources. During each ON-period for a particular source, packets arrive according to a Poisson process and packet sizes (hence service times) can be generally distributed. In this paper, we establish heavy traffic limit theorems to provide suitable approximations for the system under first-in fi...
متن کاملA Tandem Queue with Dependent Structure for Interarrival and Service Times: an Estimation Study
Consider a single channel two station tandem queue with zero queue capacity and with blocking (Taha, 1989). Assuming that the arrival process and the service process are dependent, we obtain the transient solution for the system when the joint distribution of interarrival time, service time at Station1 and service time at Station 2 is trivariate exponential. Also, CAN estimators and asymptotic ...
متن کاملHeavy-traffic Limit Theorems for the Heavy-tailed Gi/g/1 Queue Heavy-traac Limit Theorems for the Heavy-tailed Gi/g/1 Queue
The classic GI=G=1 queueing model of which the tail of the service time and/or the interarrival time distribution behaves as t ?v S(t) for t ! 1, 1 < v < 2 and S(t) a slowly varying function at innnity, is investigated for the case that the traac load a approaches one. Heavy-traac limit theorems are derived for the case that these tails have a similar behaviour at innnity as well as for the cas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2017
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-017-9560-z